By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 8, Issue 3, pp. 287-478

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Automatic Asymptotic and Big-$O$ Calculations via Computer Algebra

David R. Stoutemyer

pp. 287-299

BibTeX  Abstract Full Text:  PDF

New Algorithms for Polynomial Square-Free Decomposition over the Integers

Paul S. Wang and Barry M. Trager

pp. 300-305

BibTeX  Abstract Full Text:  PDF

Symbolic Vector and Dyadic Analysis

Michael C. Wirth

pp. 306-319

BibTeX  Abstract Full Text:  PDF

A Natural Structure Theorem for Complex Fields

H. I. Epstein

pp. 320-325

BibTeX  Abstract Full Text:  PDF

New Algorithms for Polynomial Multiplication

Dorothea A. Klip

pp. 326-343

BibTeX  Abstract Full Text:  PDF

Some Remarks on Computing Galois Groups

J. McKay

pp. 344-347

BibTeX  Abstract Full Text:  PDF

Uniform Bounds for a Class of Algebraic Mappings

David Y. Y. Yun

pp. 348-356

BibTeX  Abstract Full Text:  PDF

A Structure Theorem for Exponential and Primitive Functions

Michael Rothstein and B. F. Caviness

pp. 357-367

BibTeX  Abstract Full Text:  PDF

The Complexity of Pattern Matching for a Random String

Andrew Chi-Chih Yao

pp. 368-387

BibTeX  Abstract Full Text:  PDF

On the Number of Comparisons to Find the Intersection of Two Relations

L. J. Stockmeyer and C. K. Wong

pp. 388-404

BibTeX  Abstract Full Text:  PDF

Scheduling Interval-Ordered Tasks

C. H. Papadimitriou and M. Yannakakis

pp. 405-409

BibTeX  Abstract Full Text:  PDF

The Complexity of Enumeration and Reliability Problems

Leslie G. Valiant

pp. 410-421

BibTeX  Abstract Full Text:  PDF

Multi-Terminal $0$–$1$ Flow

Yossi Shiloach

pp. 422-430

BibTeX  Abstract Full Text:  PDF

A Note on Sparse Complete Sets

Steven Fortune

pp. 431-433

BibTeX  Abstract Full Text:  PDF

Polynomial Space and Transitive Closure

Ronald V. Book

pp. 434-439

BibTeX  Abstract Full Text:  PDF

On the Expected Value of a Random Assignment Problem

David W. Walkup

pp. 440-442

BibTeX  Abstract Full Text:  PDF

Optimal Evaluation of Pairs of Bilinear Forms

Joseph JáJá

pp. 443-462

BibTeX  Abstract Full Text:  PDF

Efficient Ordering of Hash Tables

Gaston H. Gonnet and J. Ian Munro

pp. 463-478

BibTeX  Abstract Full Text:  PDF